Simple PTAS's for families of graphs excluding a minor
نویسندگان
چکیده
We show that very simple algorithms based on local search are polynomial-time approximation schemes for Maximum Independent Set, Minimum Vertex Cover and Minimum Dominating Set, when the input graphs have a fixed forbidden minor.
منابع مشابه
The Graph Minor Theorem
2 Properties excluding a planar graph 3 2.1 Path-width and tree-width . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Excluding a forest . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Planar graphs and sleeve unions . . . . . . . . . . . . . . . . . . 10 2.4 Planar graphs and grids . . . . . . . . . . . . . . . . . . . . . . . 13 2.5 Families with bounded tree-width . . . . . . . ....
متن کاملOn vertex rankings of graphs and its relatives
A vertex ranking of a graph is an assignment of ranks (or colors) to the vertices of the graph, in such a way that any simple path connecting two vertices of equal rank, must contain a vertex of a higher rank. In this paper we study a relaxation of this notion, in which the requirement above should only hold for paths of some bounded length l for some fixed l. For instance, already the case l =...
متن کامل8 F eb 2 01 2 Cliques in Odd - Minor - Free Graphs ∗
This paper is about: (1) bounds on the number of cliques in a graph in a particular class, and (2) algorithms for listing all cliques in a graph. We present a simple algorithm that lists all cliques in an n-vertex graph in O(n) time per clique. For O(1)-degenerate graphs, such as graphs excluding a fixed minor, we describe a O(n) time algorithm for listing all cliques. We prove that graphs excl...
متن کاملCliques in Odd-Minor-Free Graphs
This paper is about: (1) bounds on the number of cliques in a graph in a particular class, and (2) algorithms for listing all cliques in a graph. We present a simple algorithm that lists all cliques in an n-vertex graph in O(n) time per clique. For O(1)-degenerate graphs, such as graphs excluding a fixed minor, we describe a O(n) time algorithm for listing all cliques. We prove that graphs excl...
متن کاملLayered Separators in Minor-Closed Families with Applications
Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applications, their usefulness is limited by the fact that the separator can be as large as Ω( √ n) in graphs with n vertices. This is the case for planar graphs, and more generally, for proper minor-closed classes. We study a special type of graph separator, called a layered separator, which may have ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 189 شماره
صفحات -
تاریخ انتشار 2015